Bohr–Jessen process and functional limit theorem
نویسندگان
چکیده
منابع مشابه
A functional combinatorial central limit theorem
The paper establishes a functional version of the Hoeffding combinatorial central limit theorem. First, a pre-limiting Gaussian process approximation is defined, and is shown to be at a distance of the order of the Lyapounov ratio from the original random process. Distance is measured by comparison of expectations of smooth functionals of the processes, and the argument is by way of Stein’s met...
متن کاملA Functional Central Limit Theorem for The
In this paper, we present a functional fluid limit theorem and a functional central limit theorem for a queue with an infinity of servers M/GI/∞. The system is represented by a point-measure valued process keeping track of the remaining processing times of the customers in service. The convergence in law of a sequence of such processes after rescaling is proved by compactness-uniqueness methods...
متن کاملA functional central limit theorem for PEPA
We present a functional central limit theorem which quantifies, as a stochastic process, the difference between a PEPA model’s underlying CTMC and its fluid approximation. We generalise existing theory to handle the case of non-smooth rate functions, which is an issue particular to modelling problems in computer science. We verify the weak convergence empirically and suggest future avenues for ...
متن کاملThe Local Limit Theorem: A Historical Perspective
The local limit theorem describes how the density of a sum of random variables follows the normal curve. However the local limit theorem is often seen as a curiosity of no particular importance when compared with the central limit theorem. Nevertheless the local limit theorem came first and is in fact associated with the foundation of probability theory by Blaise Pascal and Pierre de Fer...
متن کاملStrong Law of Large Numbers and Functional Central Limit Theorem
20.1. Additional technical results on weak convergence Given two metric spaces S1, S2 and a measurable function f : S1 → S2, suppose S1 is equipped with some probability measure P. This induces a probability measure on S2 which is denoted by Pf−1 and is defined by Pf−1(A) = P(f−1(A) for every measurable set A ⊂ S2. Then for any random variable X : S2 → R, its expectation EPf −1 [X] is equal to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kyoto Journal of Mathematics
سال: 2014
ISSN: 2156-2261
DOI: 10.1215/21562261-2642440